Successive approximation in parallel graph algorithms

‏‎a 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter‎‏

‏‎applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...

Sublinear Graph Approximation Algorithms

Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover siz...

Parallel Approximation Algorithms

Many problems of great practical importance are hard to solve computationally, at least if exact solutions are required. We survey a number of (NPor P-complete) problems for which fast parallel approximation algorithms are known: The O-l knapsack problem, binpacking, the minimal makeshift problem, the list scheduling problem, greedy scheduling, and the high density subgraph problem. Algorithms ...

Parallel Graph Algorithms

Approximation Algorithms in the Successive Hitting Set Model

We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and exper...